Vertex-Transitive Direct Products of Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independent sets in direct products of vertex-transitive graphs

Let G and H be two vertex-transitive graphs. It is easy to find that α(G × H) = |G||H | 2 if one of them is a bipartite graph. In this paper, we will identify the structure of the maximal-sized independent sets in G×H when one of them is a bipartite graph.

متن کامل

Independence and coloring properties of direct products of some vertex-transitive graphs

Let α(G) and χ(G) denote the independence number and chromatic number of a graph G respectively. Let G×H be the direct product graph of graphs G and H . We show that if G and H are circular graphs, Kneser graphs, or powers of cycles, then α(G ×H) = max{α(G)|V (H)|, α(H)|V (G)|} and χ(G×H) = min{χ(G), χ(H)}. AMS Classification: 05C15, 05C69.

متن کامل

Vertex-transitive CIS graphs

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...

متن کامل

Cores of Vertex Transitive Graphs

A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that for vertex transitive graphs, the size of the core must divide the size of the graph. This motivates the following question: when can the vertex set of a vertex transitive graph be partitioned into sets each of which induce a copy of its core? We show that normal Cayley graphs and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2018

ISSN: 1077-8926

DOI: 10.37236/6999